Theoretical and Experimental Estimation of Hypercomplex Discrete Fourier Transform Parallelization Efficiency
نویسنده
چکیده
The methods of fast parallel calculation of multidimensional hypercomplex discrete Fourier transform (HDFT) are discussed. The theoretical and experimental estimation of parallelization efficiency is given. It is shown that proposed method has very high efficiency (up to 90%).
منابع مشابه
Complex and hypercomplex discrete Fourier transforms based on matrix exponential form of Euler's formula
We show that the discrete complex, and numerous hypercomplex, Fourier transforms defined and used so far by a number of different researchers can be unified into a single theoretical framework based on a matrix exponential version of Euler’s formula e = cos θ + j sin θ, and a matrix root of −1 isomorphic to the imaginary root j. The transforms thus defined can be computed numerically using stan...
متن کاملFourier Multipliers and Dirac Operators
We use Fourier multipliers of the Dirac operator and Cauchy transform to obtain composition theorems and integral representations. In particular we calculate the multiplier of the Π-operator. This operator is the hypercomplex version of the Beurling Ahlfors transform in the plane. The hypercomplex Beuling Ahlfors transform is a direct generalization of the Beurling Ahlfors transform and reduces...
متن کاملDiscrete Fourier Transform based Channel Estimation Scheme for MIMO-OFDM Communication System
A multi-input multi-output (MIMO) communication system combined with orthogonal frequency division multiplexing (OFDM) system can provide high transmission data rate, spectral efficiency and reliability for wireless communication systems. These parameters can be further improved by combating with fading, the effect of which can be reduced by properly estimating the channel at the receiver side....
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملDetection of high impedance faults in distribution networks using Discrete Fourier Transform
In this paper, a new method for extracting dynamic properties for High Impedance Fault (HIF) detection using discrete Fourier transform (DFT) is proposed. Unlike conventional methods that use features extracted from data windows after fault to detect high impedance fault, in the proposed method, using the disturbance detection algorithm in the network, the normalized changes of the selected fea...
متن کامل